A Note on Bipolar Perfect Fuzzy Matching
نویسندگان
چکیده
منابع مشابه
Note on Perfect Forests
A spanning subgraph F of a graph G is called perfect if F is a forest, the degree dF (x) of each vertex x in F is odd, and each tree of F is an induced subgraph of G. We provide a short proof of the following theorem of A.D. Scott (Graphs & Combin., 2001): a connected graph G contains a perfect forest if and only if G has an even number of vertices.
متن کاملA NOTE ON INTUITIONISTIC FUZZY MAPPINGS
In this paper, the concept of intuitionistic fuzzy mapping as a generalization of fuzzy mapping is presented, and its' relationship with intuitionistic fuzzy relations is derived. Moreover, some basicoperations of intuitionistic fuzzy mappings are defined, hence we can conclude that all of intuitionistic fuzzy mappings constitute a soft algebrawith respect to these operations. Afterwards, the A...
متن کاملA Note on Perfect Correctness by Derandomization
We show a general compiler that transforms a large class of erroneous cryptographic schemes (such as public-key encryption, indistinguishability obfuscation, and secure multiparty computation schemes) into perfectly correct ones. The transformation works for schemes that are correct on all inputs with probability noticeably larger than half, and are secure under parallel repetition. We assume t...
متن کاملA Note on Non-Perfect Secret Sharing
By using a recently introduced framework for non-perfect secret sharing, several known results on perfect secret sharing are generalized. Specifically, we discuss about ideal secret sharing schemes, constructions of efficient linear secret sharing schemes, and the search for lower bounds on the length of the shares. Similarly to perfect secret sharing, matroids and polymatroids are very useful ...
متن کاملA note on the hardness results for the labeled perfect matching problems in bipartite graphs
In this note, we strengthen the inapproximation bound of O(log n) for the labeled perfect matching problem established in J. Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters 96 (2005) 81-88, using a self improving operation in some hard instances. It is interesting to note that this self improving operation does not work for all instances. Moreover, based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2016
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i32/47316